On axioms of Boolean algebra

Single Axioms for Boolean Algebra

Explicit single axioms are presented for Boolean algebra in terms of (1) the Sheffer stroke; (2) disjunction and negation; (3) disjunction, conjunction, and negation; and (4) disjunction, conjunction, negation, 0, and 1. It was previously known that single axioms exist for these systems, but the procedures to generate them are exponential, producing huge equations. Automated deduction technique...

A Set of Independent Axioms for Boolean Algebra

1. Introduction IT is well known that there are a number of sets of axioms for Boolean algebra. In this paper, I give a set of five independent axioms using conditioned disjunction as the ternary operation which is postulated. The ternary operation is most naturally defined on the set 2 n —this is done in §2. The theorem is stated in §3 together with a slight generalization of this result; the ...

Equational Axioms of Test Algebra

We present a complete axiomatization of test algebra the two sorted algebraic variant of Propositional Dynamic Logic PDL The axiomatization consists of adding a nite number of equations to any axiomatization of Kleene algebra and algebraic translations of the Segerberg axioms for PDL Kleene algebras are not nitely axiomatizable so our result does not give us a nite axiomatization of test algebr...

Ternary Boolean Algebra

Boolean Algebra Approximations

Knight and Stob proved that every low4 Boolean algebra is 0-isomorphic to a computable one. Furthermore, for n = 1, 2, 3, 4, every lown Boolean algebra is 0-isomorphic to a computable one. We show that this is not true for n = 5: there is a low5 Boolean algebra that is not 0-isomorphic to any computable Boolean algebra. It is worth remarking that, because of the machinery developed, the proof u...